#include <stdio.h>
#define N 200000001
char prime[N];
void fill() {
  int i, j;
  for (i = 0; i < N; i++)
    prime[i] = 1;
  prime[0] = prime[1] = 0;
  for (i = 2; i *i <= N; i++)
    if (prime[i])
      for (j = i * i; j < N; j += i)
        prime[j] = 0;
}
int check(int n) {
  int p;
  for (p = 3; p <= n / 2; p += 2)
    if (prime[p] && prime[n - p])
      return 1;
  return 0;
}

int main() {
  int start = 6, end = 2000000;
  int n;
  long long x = clock();
  fill();
  for (n = start; n <= end; n += 2)
    if (!check(n))
      printf("Congratulations!!,for %d the theory is Wrong!\n", n);
  long long y = clock();
  printf("%.3f second(s)!", (y - x) / 1000.0);
  return 0;
}
